A Variational Approach to Copositive Matrices
نویسندگان
چکیده
This work surveys essential properties of the so-called copositive matrices, the study of which is spread over more than fifty-five years. Special emphasis is given to variational aspects related to the concept of copositivity. In addition, some new results on the geometry of the cone of copositive matrices are presented here for the first time.
منابع مشابه
On the maximal angle between copositive matrices
Hiriart-Urruty and Seeger have posed the problem of finding the maximal possible angle θmax(Cn) between two copositive matrices of order n [J.-B. Hiriart-Urruty and A. Seeger. A variational approach to copositive matrices. SIAM Rev., 52:593–629, 2010.]. They have proved that θmax(C2) = 3 4 π and conjectured that θmax(Cn) is equal to 3 4 π for all n ≥ 2. In this note, their conjecture is disprov...
متن کاملEla Constructing Copositive Matrices from Interior Matrices
Abstract. Let A be an n by n symmetric matrix with real entries. Using the l1-norm for vectors and letting S 1 = {x ∈ R|||x||1 = 1, x ≥ 0}, the matrix A is said to be interior if the quadratic form x Ax achieves its minimum on S 1 in the interior. Necessary and sufficient conditions are provided for a matrix to be interior. A copositive matrix is referred to as being exceptional if it is not th...
متن کاملLineality Removal for Copositive{plus Normal Maps
We are concerned with solving aane variational inequalities deened by a linear map A and a polyhedral set C. Most of the existing pivotal methods for such inequalities or mixed linear complementarity problems depend on the existence of extreme points in C or a certain non{singularity property of A with respect to the lineality of C. In this paper, we prove that if A is copositive{plus with resp...
متن کاملCopositive Programming by Simplicial Partition
Copositivity plays an important role in combinatorial and quadratic optimization since setting up a linear optimization problem over the copositive cone leads to exact reformulations of combinatorial and quadratic programming problems. A copositive programming problem may be approached checking copositivity of several matrices built with different values of the variable and the solution is the ...
متن کاملIrreducible elements of the copositive cone
An element A of the n× n copositive cone C is called irreducible with respect to the nonnegative cone N if it cannot be written as a nontrivial sum A = C + N of a copositive matrix C and an elementwise nonnegative matrix N . This property was studied by Baumert [2] who gave a characterisation of irreducible matrices. We demonstrate here that Baumert’s characterisation is incorrect and give a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM Review
دوره 52 شماره
صفحات -
تاریخ انتشار 2010